翻訳と辞書 |
Aggregative game : ウィキペディア英語版 | Aggregative game In game theory, an aggregative game is a game in which every player’s payoff is a function of the player’s own strategy and the aggregate of all players’ strategies. The concept was first proposed by Nobel laureate Reinhard Selten in 1970 who considered the case where the aggregate is the sum of the players' strategies. == Definition == Consider a standard non-cooperative game with ''n'' players, where is the strategy set of player ''i'', is the joint strategy set, and is the payoff function of player ''i''. The game is then called an ''aggregative game'' if for each player ''i'' there exists a function such that for all : : In words, payoff functions in aggregative games depend on players' ''own strategies'' and the ''aggregate'' . As an example, consider the Cournot model where firm ''i'' has payoff/profit function (here and are, respectively, the inverse demand function and the cost function of firm ''i''). This is an aggregative game since where .
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Aggregative game」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|